Improved Immune Algorithm Combined with Steepest Descent Method for Optimal Design of IPMSM for FCEV Traction Motor

نویسندگان

چکیده

In this paper, an improved immune algorithm (IIA) was proposed for the torque ripple reduction optimal design of interior permanent magnet synchronous motor (IPMSM) a fuel cell electric vehicle (FCEV) traction motor. When designing machines, both global and local solutions designs are required as result should be compared in various aspects, including torque, ripple, cogging torque. To lessen computational burden optimization using finite element analysis, IIA proposes method to efficiently adjust generation additional samples. The superior performance verified through comparison results with conventional methods three mathematical test functions. IPMSM conducted verify applicability practical machines.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Steepest Descent Method for Matrix

We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...

متن کامل

Rotor Design of IPMSM Traction Motor Based on Multi- Objective Optimization using BFGS Method and Train Motion Equations

In this paper a multiobjective optimal design method of interior permanent magnet synchronous motor ( IPMSM) for traction applications so as to maximize average torque and to minimize torque ripple has been presented. Based on train motion equations and physical properties of train, desired specifications such as steady state speed, rated output power, acceleration time and rated speed of tract...

متن کامل

On the Steepest Descent Method for Matrix

We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...

متن کامل

IMPROVED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL DIMENSIONAL DESIGN OF STRUCTURAL WALLS SYSTEM

Among the different lateral force resisting systems, shear walls are of appropriate stiffness and hence are extensively employed in the design of high-rise structures. The architectural concerns regarding the safety of these structures have further widened the application of coupled shear walls. The present study investigated the optimal dimensional design of coupled shear walls based on the im...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Energies

سال: 2021

ISSN: ['1996-1073']

DOI: https://doi.org/10.3390/en14133904